package blyth;

import java.awt.Point;

public class Node {

    public Point point;
    public Node reachedFrom;
    public int cost, heuristics;

    public Node(Point point, Node reachedFrom, int cost, Point goal) {
        this.point = point;
        this.reachedFrom = reachedFrom;
        this.cost = cost;
        this.heuristics = Heur.Manhattan(point, goal) * Tile.basicMovementCost;
        if (point.equals(goal) == false) {
            this.heuristics += World.CalculateEdgeHassle(point.x, point.y);            
        }                
    }
}
